Efficient polygonization of tree trunks modeled by convolution surfaces
نویسندگان
چکیده
منابع مشابه
Polygonization of implicit surfaces
This paper discusses a numerical technique that approximates an implicit surface with a polygonal representation. The implicit function is adaptively sampled as it is surrounded by a spatial partitioning. The partitioning is represented by an octree, which may either converge to the surface or track it. A piecewise polygonal representation is derived from the octree. The technique is insensitiv...
متن کاملFast Polygonization of Implicit Surfaces
Our work is centered on the use of implicit surfaces in interactive applications (at least 10 frames per sec) running on high-end consumer architecture (modeling, simulation, deformable body animation, games). We focus on the Marching Cubes algorithm that we tried to implement in an optimized way. We restrict our work to blended iso-surfaces generated by skeletons, since this kind of implicit s...
متن کاملSubdivision Surfaces for Fast Approximate Implicit Polygonization
We propose a fast method of generating an approximate polygonal mesh from an implicit surface. Current workstations are still not capable of producing polygon meshes fast enough for the interactive modelling of complex implicit models. We propose a hybrid method that combines current implicit polygonization techniques with the faster sub-division surface technique applied as a post-process to s...
متن کاملConvolution surfaces of quadratic triangular Bézier surfaces
In the present paper we prove that the polynomial quadratic triangular Bézier surfaces are LN-surfaces. We demonstrate how to reparameterize the surfaces such that the normals obtain linear coordinate functions. The close relation to quadratic Cremona transformations is elucidated. These reparameterizations can be effectively used for the computation of convolution surfaces.
متن کاملSpace Subdivision for Fast Polygonization of Implicit Surfaces
This paper presents the basic principles for the visualization of objects which are defined by implicit functions and CSG trees. The basic principles (Marching cubes, Marching tetrahedra and Marching triangles) for iso-surfaces rendering of such objects are compared. A new fast modification of the Marching triangles algorithm is presented and compared with others algorithms. It is based on the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2013
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-013-4790-0